Formal Characterisation of Immediate Actions in SPA with Nondeterministic Branching

نویسندگان

  • Holger Hermanns
  • Michael Rettelbach
  • Thorsten Weiss
چکیده

Stochastic Process Algebras (SPA) are process algebras in which the duration of each activity is given by a random variable. If the stochastic aspect is restricted to Markovian, i.e. exponentially distributed durations, nice algebraic foundations are available. They include a formal semantics and an equational theory for Markovian bisimulation , a congruence that can be seen as a stochastic counterpart of strong bisimulation. This paper extends that theory with a stochastic notion of Milner`s observational congruence. We enrich a basic SPA with immediate actions that happen instantaneously if enabled. For the enriched calculus we will derive a sound and complete characterization of Markovian observational congruence, a conservative extension of both Markovian bisimulation and observational congruence. The usefulness of immediate actions together with their equational theory will be illustrated by means of an example. Additionally, we will discuss some implementation and modelling issues arising from our results.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Probabilistic Branching in Markovian Process Algebras

We introduce immediate transitions as an extension of Stochastic Process Algebras (SPA). We distinguish two diierent classes of immediate transitions: probabilistic branching and management activities. We discuss both approaches and develop a theory for the probabilistic branching case. Although we use TIPP as a sample language within this paper, the theory can easily be adapted to other Stocha...

متن کامل

A Characterisation of NL/poly via Nondeterministic Finite Automata

For each language L ⊆ 2 and non-zero monotonic function t ∶ N → N, we define a language t∗L ⊆ 2 depending only on L and t. We then prove that a language L lies in NL/poly if and only if there exists a polynomially bounded t (as above), such that the projections (t ∗L) ∩ 2 are accepted by nondeterministic finite automata of size polynomial in n. Therefore, proving super-polynomial lower bounds f...

متن کامل

Endoscopic Cauterization of the Sphenopalatine Artery to Control Severe and Recurrent Posterior Epistaxis

Introduction: Epistaxis is one of the most common medical emergencies, making the management of posterior epistaxis a challenging problem for the ear, nose, and throat (ENT) surgeon. In the cases of conservative management failure, ligation of the major arteries or percutaneous embolization of the maxillary artery is performed routinely in most units, but rates of failure and complications are ...

متن کامل

Logiques temporelles basées sur actions pour la vérification des systèmes asynchrones

Formal verification is essential for ensuring the reliability of complex, critical applications such as communication protocols and distributed systems. The model checking approach consists in translating the application into a labelled transition system model, on which the correctness properties, expressed as temporal logic formulas, are verified by means of specific algorithms. This report pr...

متن کامل

Monte Carlo Action Programming

This paper proposes Monte Carlo Action Programming, a programming language framework for autonomous systems that act in large probabilistic state spaces with high branching factors. It comprises formal syntax and semantics of a nondeterministic action programming language. The language is interpreted stochastically via Monte Carlo Tree Search. Effectiveness of the approach is shown empirically.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Comput. J.

دوره 38  شماره 

صفحات  -

تاریخ انتشار 1995